Algebraic and graph theoretic characterizations of structured flowchart schemes
نویسندگان
چکیده
منابع مشابه
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions
Recursive analysis is the most classical approach to model and discuss computations over the real numbers. Recently, it has been shown that computability classes of functions in the sense of recursive analysis can be defined (or characterized) in an algebraic machine independent way, without resorting to Turing machines. In particular nice connections between the class of computable functions (...
متن کاملAlgebraic characterizations of graph imbeddability in surfaces and pseudosurfaces
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of face-connected components, the number of pinches, the number of crosscaps and handles, and the dimension of the first Z2-homology group. Th...
متن کاملOn Two Graph-Theoretic Characterizations of Tree Compatibility
Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility is characterized in terms of the existence of a specific kind of triangulation in a structure known as the display graph. An alternative characterization exp...
متن کاملAlgebraic and graph-theoretic properties of infinite n-posets
A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and n ω-ary product operations. Moreover, the ω-ary product operations give rise to n ω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the bin...
متن کاملGraph-Theoretic Analysis of Kautz Topology and DHT Schemes
Many proposed distributed hash table (DHT) schemes for peer-topeer network are based on some traditional parallel interconnection topologies. In this paper, we show that the Kautz graph is a very good static topology to construct DHT schemes. We demonstrate the optimal diameter and optimal fault tolerance properties of the Kautz graph and prove that the Kautz graph is (1+o(1))-congestion-free w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1979
ISSN: 0304-3975
DOI: 10.1016/0304-3975(79)90031-8